Compositional Verification of Asynchronous Processes via Constraint Solving
نویسندگان
چکیده
In this paper we investigate the foundations of a constraintbased compositional verification method for infinite-state systems. We first consider an asynchronous process calculus which is an abstract formalization of several existing languages based on the blackboard model. For this calculus we define a contraint-based symbolic representation of a compositional model based on traces. The constraint system we use combines formulas of integer arithmetics with equalities over uninterpreted function symbols in which satisfiability is decidable. The translation is inductively defined via a CLP program. Execution traces of a process can be compositionally obtained from the solutions of the answer constraints of the CLP encoding. This way, the task of compositional verification can be reduced to constraint computing and solving.
منابع مشابه
New Versions of Ask and Tell for Synchronous Communication in Concurrent Constraint Programming
Concurrent constraint programming is classically based on asynchronous communication via a shared store. This paper presents new versions of the ask and tell primitives which features synchronicity. Our approach is based on the idea of telling new information just in the case that a concurrently running process is asking for it. The new primitives are shown to be simple yet expressive enough to...
متن کاملOn the semantics of communicating hardware processes and their translation into LOTOS for the verification of asynchronous circuits with CADP
Hardware process calculi, such as Chp (Communicating Hardware Processes), Balsa, or Haste (formerly Tangram), are a natural approach for the description of asynchronous hardware architectures. These calculi are extensions of standard process calculi with particular synchronisation features implemented using handshake protocols. In this article, we first give a structural operational semantics f...
متن کاملA Compositional Minimization Approach for Large Asynchronous Design Verification
This paper presents a compositional minimization approach with efficient state space reductions for verifying non-trivial asynchronous designs. These reductions can result in a reduced model that contains the exact same set of observably equivalent behavior in the original model, therefore no false counter-examples are produced at the end of verification on the reduced model. This approach allo...
متن کاملA system for compositional verification of asynchronous objects
We present a semantics, calculus, and system for compositional verification of Creol, an object-oriented modeling language for concurrent distributed applications. The system is an instance of KeY, a framework for object-oriented software verification, which has so far been applied foremost to sequential Java. Building on KeY characteristic concepts, like dynamic logic, sequent calculus, symbol...
متن کاملCompositional Construction of Real-Time Dataflow Networks
Increasing sizes of present-day distributed software systems call for coordination models which are both modular and scalable. Precise modelling of real-life applications further requires the notion of real-time. In this paper, we present a modular formal development of a compositional model for real-time coordination in dataflow networks. While real-time dataflow networks are typically asynchr...
متن کامل